// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
struct node
{
	char z,l,r;
};
int n;
vector<node> v;
void dfs(char x)
{
	cout<<x;
	if(v[x].l!=0)dfs(v[x].l);
	if(v[x].r!=0)dfs(v[x].r);
}
signed main()
{
	
	cin>>n;
	char a,b,c,tmp;
	v=vector<node> (27);
	for(int i=1;i<=n;i++)
	{
		cin>>a>>b>>c;
		if(i==1)tmp=a;
		if(b!='*')v[a].l=b;
		if(c!='*')v[a].r=c;
	}
	dfs(tmp);
	return 0;
}
